منابع مشابه
Non-matchable distributive lattices
Based on an acyclic orientation of the Z-transformation graph, a finite distributive lattice (FDL for short)M(G) is established on the set of all 1-factors of a plane (weakly) elementary bipartite graph G. For an FDL L, if there exists a plane bipartite graph G such that L is isomorphic to M(G), then L is called a matchable FDL. A natural question arises: Is every FDL a matchable FDL? In this p...
متن کامل“ Complete - Simple ” Distributive Lattices
It is well known that the only simple distributive lattice is the twoelement chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences. In this paper we show the existence of infinite complete-simple distributive lattices. “COMPLETE-SIMPLE” DISTRIBUTIVE LATTICES G. GRÄTZER A...
متن کاملDistributive Lattices and Cohomology
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of modules over Dedekind rings. A generalized Chinese remainder theorem is derived as a consequence of the above resolution. The GelfandNaimark duality between finit...
متن کاملEvolution on distributive lattices.
We consider the directed evolution of a population after an intervention that has significantly altered the underlying fitness landscape. We model the space of genotypes as a distributive lattice; the fitness landscape is a real-valued function on that lattice. The risk of escape from intervention, i.e., the probability that the population develops an escape mutant before extinction, is encoded...
متن کاملDistributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.10.020